Adaptive Sparse Cyclic Coordinate Descent for Sparse Frequency Estimation
نویسندگان
چکیده
The frequency estimation of multiple complex sinusoids in the presence noise is important for many signal processing applications. As already discussed literature, this problem can be reformulated as a sparse representation problem. In letter, such formulation derived and an algorithm based on cyclic coordinate descent (SCCD) estimating parameters proposed. adaptively reduces size used grid, which eases computational burden. Simulation results revealed that proposed achieves similar performance to original Root-multiple classification (MUSIC) terms mean square error (MSE), with significantly less complexity.
منابع مشابه
Block Coordinate Descent for Sparse NMF
Nonnegative matrix factorization (NMF) has become a ubiquitous tool for data analysis. An important variant is the sparse NMF problem which arises when we explicitly require the learnt features to be sparse. A natural measure of sparsity is the L0 norm, however its optimization is NP-hard. Mixed norms, such as L1/L2 measure, have been shown to model sparsity robustly, based on intuitive attribu...
متن کاملGraphical Newton for Huge-Block Coordinate Descent on Sparse Graphs
Block coordinate descent (BCD) methods are often very effective for optimization problems where dependencies between variables are sparse. These methods can make a substantial amount of progress by applying Newton’s method to update a block of variables, but this leads to an iteration cost of O(|b|) in terms of the block size |b|. In this paper, we show how to use message-passing to compute the...
متن کاملPenalized Bregman Divergence Estimation via Coordinate Descent
Variable selection via penalized estimation is appealing for dimension reduction. For penalized linear regression, Efron, et al. (2004) introduced the LARS algorithm. Recently, the coordinate descent (CD) algorithm was developed by Friedman, et al. (2007) for penalized linear regression and penalized logistic regression and was shown to gain computational superiority. This paper explores...
متن کاملA Block-Coordinate Descent Approach for Large-scale Sparse Inverse Covariance Estimation
The sparse inverse covariance estimation problem arises in many statistical applications in machine learning and signal processing. In this problem, the inverse of a covariance matrix of a multivariate normal distribution is estimated, assuming that it is sparse. An `1 regularized log-determinant optimization problem is typically solved to approximate such matrices. Because of memory limitation...
متن کاملSparse non-negative tensor factorization using columnwise coordinate descent
Many applications in computer vision, biomedical informatics, and graphics deal with data in the matrix or tensor form. Non-negative matrix and tensor factorization, which extract data-dependent non-negative basis functions, have been commonly applied for the analysis of such data for data compression, visualization, and detection of hidden information (factors). In this paper, we present a fas...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Signals
سال: 2021
ISSN: ['2624-6120']
DOI: https://doi.org/10.3390/signals2020015